public class Solution {
    //Z字型查找
    public boolean searchMatrix(int[][] matrix, int target) {
        int m = matrix.length;
        int n = matrix[0].length;

        int x = 0, y = n - 1;
        while(x < m && y >= 0){
            if(matrix[x][y] < target){
                x++;
            } else if(matrix[x][y] > target){
                y--;
            } else {
                return true;
            }
        }

        return false;
    }
}
